Lower Bounds Using Kolmogorov Complexity
نویسنده
چکیده
In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functions, which gives the complexity of finding a bit where inputs differ, for pairs of inputs that map to different function values. This measure and variants thereof were shown to imply lower bounds for quantum and randomized decision tree complexity (or query complexity) [LM04]. We give a similar result for deterministic decision trees as well. It was later shown in [LLS05] that KI complexity gives lower bounds for circuit depth. We review those results here, emphasizing simple proofs using Kolmogorov complexity, instead of strongest possible lower bounds. We also present a Kolmogorov complexity alternative to Yao’s min-max principle [LL04]. As an example, this is applied to randomized one-way communication complexity.
منابع مشابه
Refined Bounds on Kolmogorov Complexity for ω-Languages
The paper investigates bounds on various notions of complexity for ω–languages. We understand the complexity of an ω–languages as the complexity of the most complex strings contained in it. There have been shown bounds on simple and prefix complexity using fractal Hausdorff dimension. Here these bounds are refined by using general Hausdorff measure originally introduced by Felix Hausdorff. Furt...
متن کاملLinear Lower Bounds and Simulations in Frege Systems with Substitutions
We investigate the complexity of proofs in Frege (F), Substitution Frege (sF) and Renaming Frege (rF) systems. Starting from a recent work of Urquhart and using Kolmogorov Complexity we give a more general framework to obtain superlogarithmic lower bounds for the number of lines in both tree-like and dag-like sF. We show the previous known lower bound, extend it to the tree-like case and, for a...
متن کاملCircuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds
This invited Descriptional Complexity of Formal Systems lecture provides an opportunity to raise awareness of the tight connection that exists between Kolmogorov Complexity and Circuit Complexity, and to argue that this connection is useful and interesting. Kolmogorov complexity has been used to provide examples of complete sets for classes such as EXP and PSPACE that are fundamentally differen...
متن کامل